A Low-Cost ECC Coprocessor for Smartcards
نویسندگان
چکیده
In this article we present a low-cost coprocessor for smartcards which supports all necessary mathematical operations for a fast calculation of the Elliptic Curve Digital Signature Algorithm (ECDSA) based on the finite field GF(2m). These ECDSA operations are GF(2m) addition, 4-bit digit-serial multiplication in GF(2m), inversion in GF(2m), and inversion in GF(p). An efficient implementation of the multiplicative inversion which breaks the 11:1 limit regarding multiplications makes it possible to use affine instead of projective coordinates for point operations on elliptic curves. A bitslice architecture allows an easy adaptation for different bit lengths. A small chip area is achieved by reusing the hardware registers for different operations.
منابع مشابه
Programmable and Parallel ECC Coprocessor Architecture: Tradeoffs between Area, Speed and Security
Elliptic Curve Cryptography implementations are known to be vulnerable to various side-channel attacks and fault injection attacks, and many countermeasures have been proposed. However, selecting and integrating a set of countermeasures targeting multiple attacks into an ECC design is far from trivial. Security, performance and cost need to be considered together. In this paper, we describe a g...
متن کاملHW/SW co-design for public-key cryptosystems on the 8051 micro-controller
It is a challenge to implement large word length public-key algorithms on embedded systems. Examples are smartcards, RF-ID tags and mobile terminals. This paper presents a HW/SW co-design solution for RSA and Elliptic Curve Cryptography (ECC) over GF(p) on a 12 MHz 8-bit 8051 micro-controller. The hardware coprocessor has a Modular Arithmetic Logic Unit (MALU) of which the digit size (d) is var...
متن کاملArea Flexible GF(2k) Elliptic Curve Cryptography Coprocessor
Elliptic curve cryptography (ECC) is popularly defined either over GF(p) or GF(2 k). This research modifies a GF(p) multiplication algorithm to make it applicable for GF(2 k). Both algorithms, the GF(p) and GF(2 k) one, are designed in hardware to be compared. The GF(2 k) multiplier is found faster and small. This GF(2 k) multiplier is further improved to benefit in speed, it gained more than 4...
متن کاملHigh speed and Low space complexity FPGA based ECC processor
Elliptic Curve Cryptography is one of the most interested research topic in VLSI. Network security is becoming more and more crucial as the volume of data being exchanged on the Internet increases. ECC offers high security for networking and communication. FPGA based architecture for elliptic curve cryptography coprocessor ,which has promising performance in terms of both Space Complexity and T...
متن کاملOptimizing the Control Hierarchy of an ECC Coprocessor Design on an FPGA Based SoC Platform
Most hardware/software codesigns of Elliptic Curve Cryptography only have one central control unit, typically a 32 bit or 8 bit processor core. With the ability of integrating several soft processor cores into one FPGA fabric, we can have a hierarchy of controllers in one SoC design. Compared to the previous codesigns trying to optimize the communication overhead between the central control uni...
متن کامل